Extensions of Some Results concerning Odd Perfect Numbers
نویسندگان
چکیده
for distinct odd primes p, ql9 ..., qt, with p = a = 1 (mod 4). (We shall always assume this form for the prime factor decomposition of N) . Many writers have found conditions which must be satisfied by the exponents 23i» ...5 2(3t» and it is our intention here to extend some of those results. We shall find it necessary to call on a number of conditions of other types, some of which have only recently been found. These are outlined in Section 2. It is known (see [8]) that we cannot have ^ E 1 (mod 3) for all i or (see [9]) &i = 17 (mod 35) for all i. Also, if 3i = ••• = 3t = 3, then: from [6], 3 ^ 2 ; from [4], 3 + 3; and from [9], 3 + 5, 12, 24, or 62. We shall prove
منابع مشابه
On Dickson's Theorem Concerning Odd Perfect Numbers
A 1913 theorem of Dickson asserts that for each fixed natural number k, there are only finitely many odd perfect numbers N with at most k distinct prime factors. We show that the number of such N is bounded by 4k 2 .
متن کاملON RELATIVE CENTRAL EXTENSIONS AND COVERING PAIRS
Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...
متن کاملPrimes Generated by Recurrence Sequences
will contain infinitely many prime terms — known as Mersenne primes. The Mersenne prime conjecture is related to a classical problem in number theory concerning perfect numbers. A whole number is said to be perfect if, like 6 = 1 + 2 + 3 and 28 = 1 + 2 + 4 + 7 + 14, it is equal to the sum of all its divisors apart from itself. Euclid pointed out that 2k−1(2k − 1) is perfect whenever 2 − 1 is pr...
متن کاملOdd perfect numbers have at least nine distinct prime factors
An odd perfect number, N , is shown to have at least nine distinct prime factors. If 3 N then N must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect numbers.
متن کاملAn Upper Bound for Odd Perfect Numbers
If N is an odd perfect number with k distinct prime factors then we show that N < 2 k . If some of the small prime factors of N are known then this bound can be further improved.
متن کامل